Time complexity

Results: 894



#Item
71Theoretical computer science / Computational complexity theory / Mathematics / Constraint programming / NP-complete problems / Boolean algebra / Parameterized complexity / Boolean satisfiability problem / Constraint satisfaction problem / Exponential time hypothesis / Treewidth / Tree decomposition

Complexity and Approximability of Parameterized MAX-CSPs Holger Dell1 , Eun Jung Kim2 , Michael Lampis3 , Valia Mitsou4 , and Tobias Mömke5 1

Add to Reading List

Source URL: drops.dagstuhl.de

Language: English - Date: 2015-11-09 10:22:02
72Mathematics / Graph theory / Operations research / Computational complexity theory / Combinatorial optimization / Mathematical optimization / Travelling salesman problem / Dynamic programming / Algorithm / Approximation algorithm / Heterogeneous Earliest Finish Time / Assignment problem

Geoinformatica DOIs10707Task selection in spatial crowdsourcing from worker’s perspective Dingxiong Deng1 · Cyrus Shahabi1 ·

Add to Reading List

Source URL: infolab.usc.edu

Language: English - Date: 2016-05-21 03:16:43
73Computational complexity theory / Theory of computation / Operations research / Complexity classes / Combinatorial optimization / Analysis of algorithms / Knapsack problem / Simplex algorithm / Time complexity / Optimization problem / NP / Polynomial-time approximation scheme

CS264: Beyond Worst-Case Analysis Lecture #15: Smoothed Complexity and Pseudopolynomial-Time Algorithms∗ Tim Roughgarden† November 5, 2014

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-12-24 22:57:16
74Computational complexity theory / Theory of computation / Analysis of algorithms / Time complexity / NC

Self-Improving Algorithms ∗ Nir Ailon† Bernard Chazelle† Abstract

Add to Reading List

Source URL: www.cs.princeton.edu

Language: English - Date: 2006-01-17 21:15:40
75Theoretical computer science / Mathematics / Formal methods / Constraint programming / Boolean algebra / Automated theorem proving / DPLL algorithm / Binary decision diagram / Exponential time hypothesis / Computational complexity theory / Bayesian network / Distribution

Fast d-DNNF Compilation with sharpSAT Christian Muise Sheila McIlraith J. Christopher Beck

Add to Reading List

Source URL: www.haz.ca

Language: English - Date: 2013-10-28 07:18:32
76Computational complexity theory / Theory of computation / Dynamic programming / Markov decision process / Stochastic control / Analysis of algorithms / Mathematical logic / Reinforcement learning / Time complexity / Algorithm / PP

Verification of Markov Decision Processes using Learning Algorithms? Tom´asˇ Br´azdil1 , Krishnendu Chatterjee2 , Martin Chmel´ık2 , Vojtˇech Forejt3 , Jan Kˇret´ınsk´y2 , Marta Kwiatkowska3 , David Parker4 , a

Add to Reading List

Source URL: www.hieratic.eu

Language: English
77Sorting algorithms / Analysis of algorithms / External sorting / Merge sort / Algorithm / Randomized algorithm / Samplesort / Selection algorithm / In-place algorithm / Time complexity / The Art of Computer Programming / Best /  worst and average case

Scalable Distributed-Memory External Sorting Mirko Rahn, Peter Sanders, Johannes Singler4 Karlsruhe Institute of Technology Postfach 6980, 76128 Karlsruhe, Germany arXiv:0910.2582v1 [cs.DS] 14 Oct 2009

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2009-10-14 08:51:26
78Circuit complexity / NC / Operations research / Scheduling

Competitive Non-migratory Scheduling for Flow Time and Energy Tak-Wah Lam Lap-Kei Lee

Add to Reading List

Source URL: cgi.csc.liv.ac.uk

Language: English - Date: 2008-05-05 11:55:59
79NP-complete problems / Computational complexity theory / Analysis of algorithms / Operations research / NP-hard problems / Vertex cover / Travelling salesman problem / Dynamic programming / Parameterized complexity / Independent set / Algorithm / 2-satisfiability

CS261: A Second Course in Algorithms Lecture #19: Beating Brute-Force Search∗ Tim Roughgarden† March 8, 2016 A popular myth is that, for N P -hard problems, there are no algorithms with worst-case running time better

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2016-03-15 10:47:56
UPDATE